Inclusion–Exclusion Principles for Convex Hulls and the Euler Relation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inclusion-Exclusion Principles for Convex Hulls and the Euler Relation

Abstract. Consider n points X1, . . . ,Xn in R and denote their convex hull by Π. We prove a number of inclusion-exclusion identities for the system of convex hulls ΠI := conv(Xi : i ∈ I), where I ranges over all subsets of {1, . . . , n}. For instance, denoting by ck(X) the number of k-element subcollections of (X1, . . . ,Xn) whose convex hull contains a point X ∈ R, we prove that c1(X) − c2(...

متن کامل

Convex Hulls for Random Lines

Consider n i .i .d . random lines in the plane defined by their slope and distance from the origin . The slope is uniformly distributed on (0, 27r] and independent of the distance R from the origin . These lines define a set I of n(n 1)/2 intersection points . It was recently shown by Atallah and Ching and Lee that the cardinality of the convex hull of these intersection points is 0(n), and the...

متن کامل

Formalizing Convex Hulls Algorithms

We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...

متن کامل

Convex hulls, oracles, and homology

This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem CompletenessC, which in turn can be solved by a simplicial homology computation. Like other convex hull algorithms, our algorithm is polynomial (in the size of input plus output) for simplicial or simple input. We show that the “no”-case of CompletenessC has a certi...

متن کامل

Steaming on Convex Hulls

This is a sea story about using a simple classroom example to save a great deal of money, as well as to convince beginning Postgraduate Naval School operations research students—experienced, skeptical military officers—that mathematical analysis can yield immediate results. The application is planning a ship’s transit from one point to another in a fixed amount of time, given that the ship can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2017

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-017-9880-0